翻訳と辞書 Words near each other ・ Non-cognitivism ・ Non-combatant ・ Non-Combatant Corps ・ Non-combatant evacuation operation ・ Non-commercial ・ Non-commercial advertising ・ Non-commercial educational ・ Non-commissioned member ・ Non-commissioned officer ・ Non-Commissioned Officer Academy ・ Non-Commissioned Officer in Charge ・ Non-Commissioned Officer Professional Development Ribbon ・ Non-communicable disease ・ Non-communications signals ・ Non-commutative conditional expectation ・ Non-commutative cryptography ・ Non-compact stencil ・ Non-compete clause ・ Non-competitive antagonist ・ Non-competitive inhibition ・ Non-configurational language ・ Non-conforming loan ・ Non-conforming mortgage ・ Non-conformists of the 1930s ・ Non-constituency Member of Parliament ・ Non-constructive algorithm existence proofs ・ Non-consultant hospital doctor ・ Non-contact atomic force microscopy ・ Non-contact force ・ Non-contact thermography Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Non-commutative cryptography ： ウィキペディア英語版 Non-commutative cryptography Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups, groups and rings which are non-commutative. One of the earliest applications of a non-commutative algebraic structure for cryptographic purposes was the use of braid groups to develop cryptographic protocols. Later several other non-commutative structures like Thompson groups, polycyclic groups, Grigorchuk groups, and matrix groups have been identified as potential candidates for cryptographic applications. In contrast to non-commutative cryptography, the currently widely used public-key cryptosystems like RSA cryptosystem, Diffie-Hellman key exchange and elliptic curve cryptography are based on number theory and hence depend on commutative algebraic structures. Non-commutative cryptographic protocols have been developed for solving various cryptographic problems like key exchange, encryption-decryption, and authentication. These protocols are very similar to the corresponding protocols in the commutative case. ==Some non-commutative cryptographic protocols== In these protocols it would be assumed that ''G'' is a non-abelian group. If ''w'' and ''a'' are elements of ''G'' the notation ''w''''a'' would indicate the element ''a−1wa''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Non-commutative cryptography」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.